北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2009, Vol. 32 ›› Issue (4): 113-116.doi: 10.13190/jbupt.200904.113.wuj

• 研究报告 • 上一篇    下一篇

针对BPCS隐写的隐写分析法

武嘉 张茹 钮心忻 杨义先   

  1. 北京邮电大学 北京邮电大学网络与交换技术国家重点实验室 北京邮电大学 信息安全中心
  • 收稿日期:2008-12-11 修回日期:2009-04-27 出版日期:2009-08-28 发布日期:2009-08-28
  • 通讯作者: 武嘉

Reliable Detection of BPCS Steganography

  • Received:2008-12-11 Revised:2009-04-27 Online:2009-08-28 Published:2009-08-28

摘要:

为实现对位平面复杂度分割(BPCS)隐写的有效检测,分析了图像复杂度直方图在像素块替
换前后的变化,针对载密图像的位平面复杂度直方图出现明显的不连续点,定义了新的直方
图不连续性测度,并提出了改进的检测算法. 与已有算法相比,改进算法的虚警率和漏检率
降低20%以上,并且易于实现,有利于实现实时检测.

关键词: 隐写分析, BPCS算法(位平面复杂度分割), 复杂度直方图, 位平面像素块

Abstract:

Bitplane complexity segmentation (BPCS) steganography replaces bitplane pixel blocks of high complexity with secret data. The continuity of the complexity histogram of the pixel block is affected by the embedded data. Based on the analysis of the security flaw in the BPCS steganography, a detection algorithm against BPCS embedding is proposed. The algorithm can reliably detect the existence of hidden data. It is easy to implement and computationally efficient, and suitable for realtime detection.

Key words: steganalysis, BPCS (Bit-plane complexity segmentation), complexity histogram, bit-plane pixel blocks